A note on probe cographs
نویسنده
چکیده
Let G be a graph and letN1, . . . ,Nk be k independent sets in G. The graph G is a k-probe cograph if G can be embedded into a cograph by adding edges between vertices that are contained in the same independent set. We show that there exists an O(k ·n) algorithm to check if a graph G is a k-probe cograph.
منابع مشابه
Characterisations and Linear-Time Recognition of Probe Cographs
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) where N is independent and G can be extended to a cograph by adding edges between certain non-probes. A partitioned probe cograph is a probe cograph with a given partition in N and P . We characterise probe cographs in se...
متن کاملProbe interval graphs and probe unit interval graphs on superclasses of cographs
A graph is probe (unit) interval if its vertices can be partitioned into two sets: a set of probe vertices and a set of nonprobe vertices, so that the set of nonprobe vertices is a stable set and it is possible to obtain a (unit) interval graph by adding edges with both endpoints in the set of nonprobe vertices. Probe (unit) interval graphs form a superclass of (unit) interval graphs. Probe int...
متن کاملEdge-clique graphs of cocktail parties have unbounded rankwidth
In an attempt to find a polynomial-time algorithm for the edgeclique cover problem on cographs we tried to prove that the edge-clique graphs of cographs have bounded rankwidth. However, this is not the case. In this note we show that the edge-clique graphs of cocktail party graphs have unbounded rankwidth.
متن کاملA faster parallel connectivity algorithm on cographs
Cographs are a well-known class of graphs arising in a wide spectrum of practical applications. In this note, we show that the connected components of a cograph G can be optimally found in O(log log log (G)) time using O( (n+m) log log log (G) ) processors on a common CRCW PRAM, or in O(log (G)) time using O( (n+m) log (G) ) processors on an EREW PRAM, where (G) is the maximum degree of G, and ...
متن کاملOn the number of reduced trees, cographs, and series-parallel graphs by compression
We give an efficient encoding and decoding scheme for computing a compact representation of a graph in one of unordered reduced trees, cographs, and series-parallel graphs. The unordered reduced trees are rooted trees in which (i) the ordering of children of each vertex does not matter, and (ii) no vertex has exactly one children. This is one of basic models frequently used in many areas. Our a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1202.0364 شماره
صفحات -
تاریخ انتشار 2012